Optimizing Connected Component Labeling Algorithms
نویسندگان
چکیده
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array based instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 ∼ 100 in our tests on random binary images.
منابع مشابه
Two Strategies to Speed up Connected Component Labeling Algorithms
This paper presents two new strategies to speed up connected component labeling algorithms. The first strategy employs a decision tree to minimize the work performed in the scanning phase of connected component labeling algorithms. The second strategy uses a simplified union-find data structure to represent the equivalence information among the labels. For 8-connected components in a two-dimens...
متن کاملNew SIMD Algorithms for Cluster Labeling on Parallel Computers
Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine....
متن کاملConnected Component Labeling Algorithms for Gray-Scale Images and Evaluation of Performance using Digital Mammograms
The main goal of this paper is to compare performance of connected component labeling algorithms on grayscale digital mammograms. This study was carried out as a part of a research for improving efficiency and accuracy of diagnosing breast cancer using digital mammograms. Three connected component labeling algorithms developed by Jung-Me Park [8], Kenji Suzuki [16] and Kesheng Wu [9], were used...
متن کاملConnected Component Labeling in CUDA
Connected component labeling (CCL) is a task of detecting connected regions in input data, and it finds its applications in pattern recognition, computer vision, and image processing. We present a new algorithm for connected component labeling in 2-D images implemented in CUDA. We first provide a brief overview of the CCL problem together with existing CPU-oriented algorithms. The rest of the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005